Fractal image compression with variance and mean
نویسندگان
چکیده
Although Fractal image compression has high quality at high compression ratio, it needs a lot of encoding time so that it has not been widely applied as other coding schemes in the field of image compression. In this paper, an algorithm is devised to improve this drawback. We utilize mean and variance to classify image blocks and combine the transformation reduction techniques to decrease the encoding time. The experimental result shows that our proposed method makes the encoder about 480 times faster than the conventional fractal compression method and the quality is imperceptible to that of the conventional fractal encoding algorithm while decreasing the bit rate as well.
منابع مشابه
An Adaptive Fractal Image Compression
In this paper an Adaptive Fractal Image Compression (AFIC) algorithm is proposed to reduce the long time of the Fractal Image Compression (FIC). AFIC worked on; minimizing the complexity and the number of matching operations by reducing both of the range and domain blocks needed in the matching process, for this purpose Zero Mean Intensity Level Fractal Image Compression based on Quadtree parti...
متن کاملSpeeding-Up Fractal Image Compression by Using Classification Range Blocks
In fractal compression technique, an image is partitioned into sub blocks called range blocks, each of which is encoded by matching it (after an appropriate affine transformation) with a block chosen from a large pool of domain blocks, which is constructed from the image itself. The problem is that the encoding is very time consuming because of the need to search in a very large domain pool. Ou...
متن کاملFractal image denoising
Over the past decade, there has been significant interest in fractal coding for the purpose of image compression. However, applications of fractal-based coding to other aspects of image processing have received little attention. We propose a fractal-based method to enhance and restore a noisy image. If the noisy image is simply fractally coded, a significant amount of the noise is suppressed. H...
متن کاملA Fast Fractal Image Compression Algorithm Based on Average-Variance Function
In order to improve the efficiency and speed of match seeking in fractal compression, this paper presents an Average-Variance function which can make the optimal choice more efficiently. Based on it, we also present a fast optimal choice fractal image compression algorithm and an optimal method of constructing data tree which greatly improve the performances of the algorithm. Analysis and exper...
متن کاملMEDICAL IMAGE COMPRESSION: A REVIEW
Within recent years the use of medical images for diagnosis purposes has become necessity. The limitation in transmission and storage space also growing size of medical images has necessitated the need for efficient method, then image Compression is required as an efficient way to reduces irrelevant and redundancy of the image data in order to be able to store or transmits data. It also reduces...
متن کامل